Stochastic Violator Model
نویسندگان
چکیده
This paper introduces a new type of violator model that is based on Markov chains. It can be used as scenario AS IS or mathematical with quantitative estimates if additional information presented. Our aim this was to develop will allow restore missing data, using existing knowledge about violator. The results show presented for general cases cover the majority attacks and applied real-life scenarios too. Summing up results, it concluded improvement should focused data gathering ensure enough recover rest.
منابع مشابه
Clarkson's Algorithm for Violator Spaces
Clarkson’s algorithm is a two-staged randomized algorithm for solving linear programs. This algorithm has been simplified and adapted to fit the framework of LP-type problems. In this framework we can tackle a number of non-linear problems such as computing the smallest enclosing ball of a set of points in R. In 2006, it has been shown that the algorithm in its original form works for violator ...
متن کاملViolator spaces vs closure spaces
Violator Spaces were introduced by J. Matoušek et al. in 2008 as generalization of Linear Programming problems. Convex geometries were invented by Edelman and Jamison in 1985 as proper combinatorial abstractions of convexity. Convex geometries are defined by antiexchange closure operators. We investigate an interrelations between violator spaces and closure spaces and show that violator spaces ...
متن کاملViolator Spaces: Structure and Algorithms
Sharir and Welzl introduced an abstract framework for optimization problems, called LP-type problems or also generalized linear programming problems, which proved useful in algorithm design. We define a new, and as we believe, simpler and more natural framework: violator spaces, which constitute a proper generalization of LP-type problems. We show that Clarkson’s randomized algorithms for low-d...
متن کاملOn the Number of Violator Spaces
We estimate the number of violator spaces of given dimension d and number of constraints n. We show that the number of nondegenerate regular violator spaces is at most n d , and that the number of all violator spaces is at least of order exp(n). This is related to the question whether the class of optimization problems described by violator spaces (or LP-type problems) is more general than line...
متن کاملStochastic Facilities location Model by Using Stochastic Programming
Finding the location for plans like factories or warehousesfor any organization is an important and strategic decision. Costs oftransportation which are the main part of the price of the goods, is thefunction of the location of these projects. to find the optimum locationof these projects, there have been various methods proposed which areusually defined (not random). In reality and in dealing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical and applied cybersecurity
سال: 2022
ISSN: ['2664-2913', '2708-1397']
DOI: https://doi.org/10.20535/tacs.2664-29132021.1.251308